Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits
نویسندگان
چکیده
منابع مشابه
Unbalancing Sets and an Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits
We prove a lower bound of Ω(n/ log n) on the size of any syntactically multilinear arithmetic circuit computing some explicit multilinear polynomial f(x1, . . . , xn). Our approach expands and improves upon a result of Raz, Shpilka and Yehudayoff ([RSY08]), who proved a lower bound of Ω(n/ log n) for the same polynomial. Our improvement follows from an asymptotically optimal lower bound, in a c...
متن کاملAn Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits
We prove a lower bound of Ω(n/ log n) on the size of any syntactically multilinear arithmetic circuit computing some explicit multilinear polynomial f(x1, . . . , xn). Our approach expands and improves upon a result of Raz, Shpilka and Yehudayoff ([RSY08]), who proved a lower bound of Ω(n/ log n) for the same polynomial. Our improvement follows from an asymptotically optimal lower bound, in a c...
متن کاملAn Almost Cubic Lower Bound for Depth Three Arithmetic Circuits
We show an Ω ( n (lnn)3 ) lower bound on the number of gates of any depth three (ΣΠΣ) arithmetic circuit computing an explicit multilinear polynomial in n variables over any field. This improves upon the previously known quadratic lower bound by Shpilka and Wigderson [SW99, SW01].
متن کاملAn Almost-Quadratic Lower Bound for Quantum Formula Size
We show that Nechiporuk’s method [14] for proving lower bound for Boolean formulas can be extended to the quantum case. This leads to an Ω(n2/ log n) lower bound for quantum formulas computing an explicit function. The only known previous explicit lower bound for quantum formulas [15] states that the majority function does not have a linear–size quantum formula.
متن کاملSome Lower Bound Results for Set-Multilinear Arithmetic Computations
In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natural restrictions of these models for which we are able to show lower bound results. Some of our results extend existing lower bounds, while others are new and raise open questions. Specifically, our main results are t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2020
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-019-4009-0